Recent techniques and results on the Erdős-Pósa property
نویسندگان
چکیده
Several min-max relations in graph theory can be expressed in the framework of the Erdős– Pósa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques for proving this property that are related to tree-like decompositions. We also provide an unified presentation of the current state of the art on this topic.
منابع مشابه
Frames, A-paths and the Erdős-Pósa property
A key feature of Simonovits’ proof of the classic Erdős-Pósa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to A-paths. With it we deduce a simple proof of Gallai’s theorem, although with a worse bound, and we verify the Erdős-Pósa property for long and for even A-paths. We also show that even A-paths do not ...
متن کاملHitting minors, subdivisions, and immersions in tournaments
The Erdős–Pósa property relates parameters of covering and packing of combinatorial structures and has been mostly studied in the setting of undirected graphs. In this note, we use results of Chudnovsky, Fradkin, Kim, and Seymour to show that, for every directed graph H (resp. strongly-connected directed graph H), the class of directed graphs that contain H as a strong minor (resp. butterfly mi...
متن کاملThe Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs
A family F of graphs is said to have the Erdős–Pósa property, if for every integer k there is an integer f(k,F) such that every graph G either contains k vertex disjoint subgraphs each isomorphic to a graph in F or a set C of at most f(k,F) vertices such that G−C has no subgraph isomorphic to a graph in F . The term Erdős–Pósa property arose because in [3] Erdős and Pósa proved that the family ...
متن کاملThe Erdos-Posa Property for Directed Graphs
A classical result by Erdős and Pósa[3] states that there is a function f : N → N such that for every k, every graph G contains k pairwise vertex disjoint cycles or a set T of at most f(k) vertices such that G− T is acyclic. The generalisation of this result to directed graphs is known as Younger’s conjecture and was proved by Reed, Robertson, Seymour and Thomas in 1996. This so-called Erdős-Pó...
متن کاملThe Erdős-Pósa Property for Long Circuits
Let G be a graph and F a family of graphs. A transversal of F is a set X of vertices of G such that G−X contains no member of F . The family F is said to have the Erdős–Pósa property if there exists a function f :N→N such that every graph G contains either k vertex-disjoint members of F or a transversal of F of size at most f(k). This concept originated in [6], where Erdős and Pósa established ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 231 شماره
صفحات -
تاریخ انتشار 2017